RISC - Linz Research Institute for Symbolic Computation
نویسندگان
چکیده
interpretation Jacques Carette and Stephen Forrest Computing and Software Department, McMaster University Hamilton, Ontario, Canada {carette,forressa}@mcmaster.ca Abstract. We continue our investigations of what exactly is in the code base of a large, general purpose, dynamically-typed computer algebra system (Maple). In this paper, we apply and adapt formal techniques from program analysis to automatically infer various core properties of Maple code as well as of Maple values. Our main tools for this task are abstract interpretation, systems of constraints, and a very modular design for the inference engine. As per previous work, our main test case is the entire Maple library, from which we provide some sample results. We continue our investigations of what exactly is in the code base of a large, general purpose, dynamically-typed computer algebra system (Maple). In this paper, we apply and adapt formal techniques from program analysis to automatically infer various core properties of Maple code as well as of Maple values. Our main tools for this task are abstract interpretation, systems of constraints, and a very modular design for the inference engine. As per previous work, our main test case is the entire Maple library, from which we provide some sample results.
منابع مشابه
3-Loop Corrections to the Heavy Flavor Wilson Coefficients in Deep-Inelastic Scattering∗
J. Ablinger1, A. Behring2, J. Blümlein†2, A. De Freitas2, A. Hasselhuhn3, A. von Manteuffel4, C.G. Raab1,5, M. Round1,2, C. Schneider1, and F. Wißbrock1,2,6 1 Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A–4040, Linz, Austria 2 Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen, Germany E-mail: johannes.bluemlein@des...
متن کاملRISC - Linz Research Institute for Symbolic Computation
We present a theorem-proving experiment performed with a computer algebra system. It proves a conjecture about the general pattern of the generating functions counting rooted maps of given genus. These functions are characterized by a complex non-linear differential system between generating functions of multi-rooted maps. Establishing a pattern for these functions requires a sophisticated indu...
متن کاملSymbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential algebras. The algebraic treatment of boundary problems brings up two new algebraic structures whose symbolic representation and computational realization is base...
متن کاملThe RISC ProofNavigator Tutorial and Manual1
This document describes the use of the RISC ProofNavigator, an interactive proving assistant for program and system reasoning developed at the Research Institute for Symbolic Computation (RISC).
متن کاملLabel Management in Mathematical Libraries
In this paper we identify the organizational problems of Mathematical Knowledge Management and describe tools that address one of these problems, namely, the management of composite, hierarchical labels for formalized knowledge. We describe how the tools are realized in the frame of the Theorema system. Acknowledgments This work was partially supported by the RISC PhD scholarship program of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007